منابع مشابه
A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data
Robust optimization is one of the fundamen tal approaches to deal with uncertainty in combinatorial optimization. This paper con siders the robust spanning tree problem with interval data, which arises in a variety of telecommunication applications. It proposes a constraint satisfaction approach using a combinatorial lower bound, a pruning com ponent that removes infeasible and subopti mal ...
متن کاملSpanning Tree Problem of Uncertain Network
In this paper we consider a spanning tree problem of uncertain network, which is a natural uncertain variation of the deterministic minimum spanning tree problem. By means of uncertainty theory, we propose three types of minimum spanning tree models for uncertain network, i.e., expected minimum spanning tree, α-minimum spanning tree, and distribution minimum spanning tree. Generally, we can the...
متن کاملMinimum Spanning Tree with Uncertain Random Weights
This paper considers the minimum spanning tree problem with uncertain random weights in an uncertain random network. The concept of uncertain random minimum spanning tree is initiated for minimum spanning tree problem with uncertain random edge weights. A model is presented to formulate a specific minimum spanning tree problem with uncertain random edge weights involving a distance chance distr...
متن کاملUncertain Distribution-Minimum Spanning Tree Problem
This paper investigates the minimum spanning tree problem in the framework of uncertainty theory, where the edge weights are assumed as uncertain variables. The concept of ideal uncertain minimum spanning tree is initiated by extending the definition of the uncertain α-minimum spanning tree. On the basis of this new concept, we propose the definition of uncertain distribution-minimum spanning t...
متن کاملUncertain Quadratic Minimum Spanning Tree Problem
The quadratic minimum spanning tree problem is to find a spanning tree on a graph that minimizes a quadratic objective function of the edge weights. In this paper, the quadratic minimum spanning tree problem is concerned on the graph with edge weights being assumed as uncertain variables. The notion of the uncertain quadratic -minimum spanning tree is introduced by using the uncertain chance co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014